منابع مشابه
Approximate convolution using DCT coefficient multipliers
DCT-domain processing, filtering, convolution, image enhancement, quantization tables We develop a method for designing DCT coefficient multipliers in order to approximate the operation of 2D convolution of an image with a given kernel. The method is easy to implement on compressed formats of DCT-based compression methods (JPEG, MPEG, H.261) by applying decoding quantization tables that are inc...
متن کاملCurrent Mode Multipliers and Constant Coefficient Multipliers for Radix N and modulo N Logic Arithmetic
This paper presents new structures of combinatorial and constant coefficient multipliers based on the current-mode gates – digital elements operating with constant, continuous power supply current. Current mode circuits do not perturb the analogue part of the chip integrated on the same die through the parasitic coupling across the substrate with the same strength as voltage mode circuits do. D...
متن کاملSwitching Activity in Bit-Serial Constant-Coefficient Serial/Parallel Multipliers
Bit-serial architectures have the advantage of high throughput, area efficient multipliers. These multipliers are implemented using shift-add operations [1], with full adders and D flip-flops as building blocks. Multiplication with a constant fixed-point coefficient is commonly used in digital signal processing (DSP) circuits, such as digital filters [2][3]. The design of a constant-coefficient...
متن کاملBit-Level Pipelinable General and Fixed Coefficient Digit-Serial/Parallel Multipliers Based on Shift-Accumulation
In this work we introduce a novel approach to digit-serial/parallel multiplication. This general class of multipliers is based on shiftaccumulation which also makes the approach suitable for implementation of shift-accumulators in distributed arithmetic. As a variable in the design process, the maximal number of cascaded fulladders can be selected. Thus, it is possible to as a special case obta...
متن کاملReduced-Area Constant-Coefficient and Multiple-Constant Multipliers for Xilinx FPGAs with 6-Input LUTs
Multiplication by a constant is a common operation for many signal, image, and video processing applications that are implemented in field-programmable gate arrays (FPGAs). Constant-coefficient multipliers (KCMs) are often implemented in the logic fabric using lookup tables (LUTs), reserving embedded hard multipliers for general-purpose multiplication. This paper describes a two-operand additio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pacific Journal of Mathematics
سال: 1970
ISSN: 0030-8730,0030-8730
DOI: 10.2140/pjm.1970.32.69